Practical Efficiency of Maximum Flow Algorithms Using Ma Orderings and Preflows
نویسندگان
چکیده
Fujishige proposed a polynomial-time maximum flow algorithm using maximum adjacency (MA) orderings. Computational results by Fujishige and Isotani showed that the algorithm was slower in practice than Goldberg and Tarjan’s algorithm. In this paper we propose an improved version of Fujishige’s algorithm using preflows. Our computational results show that the improved version is much faster than the original one in practice.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Practical Efficiency of Maximum Flow Algorithms Using MA Orderings
Fujishige proposed a polynomial-time maximum flow algorithm using maximum adjacency (MA) orderings. Computational results by Fujishige and Isotani showed that the algorithm was slower in practice than Goldberg and Tarjan’s algorithm. In this paper we propose an improved version of Fujishige’s algorithm using preflows. Our computational results show that the improved version is much faster than ...
متن کاملA NEW KARZANOV-TYPE o(n3) MAX-FLOW ALGORITHM
A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network more symmetrically by attempting to increase flow on both the ForwardStep and the BackwardStep. Th...
متن کاملOn the Practical Efficiency of Various Maximum Flow Algorithms
We investigate the practical efficiency of various maximum flow algorithms by a great number of systematica11y-designed computational experiments, where we develop and summarize the techniques useful for solving the problem in practice. The methods implemented are depth-fIrst search, breadth-fIrst search, Dinic's, Karzanov's, three Indians' and Galil and Naamad's. We conclude that, among the im...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کامل